A Vertical Partitioning Algorithm for Distributed Multimedia Databases

نویسندگان

  • Lisbeth Rodríguez-Mazahua
  • Xiaoou Li
چکیده

Efficient retrieval of multimedia objects is a key factor for the success of distributed multimedia databases. One way to provide faster access to multimedia objects in these databases is using vertical partitioning. In this paper, we present a vertical partitioning algorithm for distributed multimedia databases (MAVP) that takes into account the size of the multimedia objects in order to generate an optimal vertical partitioning scheme. The objective function of MAVP minimizes the amount of access to irrelevant data and the transportation cost of the queries in distributed multimedia databases to achieve efficient retrieval of multimedia objects. A cost model for evaluating vertical partitioning schemes in distributed multimedia databases is developed. Experimental results clarify the validness of the proposed algorithm.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic Vertical Partitioning of Multimedia Databases Using Active Rules

Vertical partitioning is a design technique widely employed in relational databases to reduce the number of irrelevant attributes accessed by the queries. Currently, due to the popularity of multimedia applications on the Internet, the need of using partitioning techniques in multimedia databases has arisen in order to use their potential advantages with regard to query optimization. In multime...

متن کامل

An Overview of Vertical Partitioning in Object-Oriented Databases

In this paper, some interesting issues related to vertical partitioning in object oriented database systems are presented. A review of existing research is given with an identification of some open problems. A taxonomy of various possible partitioning schemes and a unified view of the vertical partitioning problem are also presented. Existing vertical partitioning algorithms have been studied f...

متن کامل

An adaptable vertical partitioning method in distributed systems

Vertical partitioning is a process of generating the fragments, each of which is composed of attributes with high affinity. The concept of vertical partitioning has been applied to many research areas, especially databases and distributed systems, in order to improve the performance of query execution and system throughput. However, most previous approaches have focused their attention on gener...

متن کامل

A Vertical Partitioning Algorithm for Distributed Object Oriented Databases

Object Oriented Databases (OODB) is becoming popular day by day and being used in a large number of application domains. In order to support homogeneous distributed OODBs a clear understanding of partitioning of class and how to do it by using different partitioning algorithms is needed. In this paper an algorithm for vertical fragmentation in a model consisting of class and comprising of compl...

متن کامل

ENERGY AWARE DISTRIBUTED PARTITIONING DETECTION AND CONNECTIVITY RESTORATION ALGORITHM IN WIRELESS SENSOR NETWORKS

 Mobile sensor networks rely heavily on inter-sensor connectivity for collection of data. Nodes in these networks monitor different regions of an area of interest and collectively present a global overview of some monitored activities or phenomena. A failure of a sensor leads to loss of connectivity and may cause partitioning of the network into disjoint segments. A number of approaches have be...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011